About randomised distributed graph colouring and graph partition algorithms
نویسندگان
چکیده
Article history: Received 14 April 2010 Revised 20 June 2010 Available online 1 August 2010
منابع مشابه
An Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring
1.1 The Problem Let G = (V,E) be a simple undirected graph. A vertex colouring of G assigns colours to each vertex in such a way that neighbours have different colours. In this paper we discuss how efficient (time and bits) vertex colouring may be accomplished by exchange of bits between neighbouring vertices. The distributed complexity of vertex colouring is of fundamental interest for the stu...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملDeterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring
In the fractional graph colouring problem, the task is to schedule the activities of the nodes so that each node is active for 1 time unit in total, and at each point of time the set of active nodes forms an independent set. We show that for any α > 1 there exists a deterministic distributed algorithm that finds a fractional graph colouring of length at most α(∆ + 1) in any graph in one synchro...
متن کاملOptimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
We present and analyse Las Vegas distributed algorithms which compute a MIS or a maximal matching for anonymous rings. Their bit complexity and time complexity are O( √ logn) with high probability. These algorithms are optimal modulo a multiplicative constant. Beyond the complexity results, the interest of this work stands in the description and the analysis of these algorithms which may be eas...
متن کاملAsynchronous Execution and Communication Latency in Distributed Constraint Optimization
DCR-2002, 16 July, Bologna Outline: • Motivation: real-time coordination of sensors in a high-latency network • Modeling coordination as graph colouring • Soft graph colouring for real-time responsiveness • A class of distributed anytime algorithms (synchronous) • Convergence • Tightness of constraints: conservative variant • Scalability and robustness • Asynchronous execution • Very high commu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 208 شماره
صفحات -
تاریخ انتشار 2010